Discrete Semi-Self-Decomposability Induced by Semigroups
نویسندگان
چکیده
منابع مشابه
Self-decomposability and Option Pricing
The risk-neutral process is modeled by a four parameter self-similar process of independent increments with a self-decomposable law for its unit time distribution. Six different processes in this general class are theoretically formulated and empirically investigated. We show that all six models are capable of adequately synthesizing European option prices across the spectrum of strikes and mat...
متن کاملStability of additive functional equation on discrete quantum semigroups
We construct a noncommutative analog of additive functional equations on discrete quantum semigroups and show that this noncommutative functional equation has Hyers-Ulam stability on amenable discrete quantum semigroups. The discrete quantum semigroups that we consider in this paper are in the sense of van Daele, and the amenability is in the sense of Bèdos-Murphy-Tuset. Our main result genera...
متن کاملReconstruction of Discrete Sets from Four Projections: Strong Decomposability
In this paper we introduce the class of strongly decomposable discrete sets and give an efficient algorithm for reconstructing discrete sets of this class from four projections. It is also shown that every Q-convex set (along the set of directions {x, y}) consisting of several components is strongly decomposable. As a consequence of strong decomposability we get that in a subclass of hv-convex ...
متن کاملDiscrete Product Systems and Twisted Crossed Products by Semigroups
A product system E over a semigroup P is a family of Hilbert spaces {Es : s ∈ P} together with multiplications Es×Et → Est. We view E as a unitary-valued cocycle on P , and consider twisted crossed products A⋊β,EP involving E and an action β of P by endomorphisms of a C∗-algebra A. When P is quasi-lattice ordered in the sense of Nica, we isolate a class of covariant representations of E, and co...
متن کاملPotential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems
This paper provides a framework that reduces the computational complexity of the discrete logarithm problem. The paper describes how to decompose the initial DLP onto several DLPs of smaller dimensions. Decomposability of the DLP is an indicator of potential vulnerability of encrypted messages transmitted via open channels of the Internet or within corporate networks. Several numerical examples...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2011
ISSN: 1083-6489
DOI: 10.1214/ejp.v16-890